A Note on On-Line Ramsey Numbers for Some Paths
نویسندگان
چکیده
We consider the important generalisation of Ramsey numbers, namely on-line numbers. It is easiest to understand them by considering a game between two players, Builder and Painter, on an infinite set vertices. In each round, joins non-adjacent vertices with edge, Painter colors edge red or blue. An number r˜(G,H) minimum rounds it takes force create copy graph G blue H, assuming that both play perfectly. The Painter’s goal resist do so for as long possible. this paper, we case where path P4 H P10 P11.
منابع مشابه
A Note On Off-Diagonal Small On-Line Ramsey Numbers For Paths
In this note we consider the on-line Ramsey numbers R(Pn, Pm) for paths. Using a high performance computing clusters, we calculated the values for off-diagonal numbers for paths of lengths at most 8. Also, we were able to check thatR(P9, P9) = 17, thus solving the problem raised in [5].
متن کاملA Note on On-line Ramsey Numbers for Quadrilaterals
We consider on-line Ramsey numbers defined by a game played between two players, Builder and Painter. In each round Builder draws an the edge and Painter colors it either red or blue, as it appears. Builder’s goal is to force Painter to create a monochromatic copy of a fixed graph H in as few rounds as possible. The minimum number of rounds (assuming both players play perfectly) is the on-line ...
متن کاملA note on small on-line Ramsey numbers for paths and their generalization
In this note, we consider the on-line Ramsey numbers R(Pn) for paths and their generalization. The standard on-line Ramsey game is played on an unbounded set of vertices, whereas the new variant of the game we consider is the game where the number of vertices is bounded. Using a computer cluster of 80 processors, we ‘calculated’ some new values for short paths, both for the generalized on-line ...
متن کاملOn-line Ramsey Numbers for Paths and Stars
We study on-line version of size-Ramsey numbers of graphs defined via a game played between Builder and Painter: in one round Builder joins two vertices by an edge and Painter paints it red or blue. The goal of Builder is to force Painter to create a monochromatic copy of a fixed graph H in as few rounds as possible. The minimum number of rounds (assuming both players play perfectly) is the on-...
متن کاملOn some three color Ramsey numbers for paths and cycles
For graphs G1, G2, G3, the three-color Ramsey number R(G1, G2, G3) is the smallest integer n such that if we arbitrarily color the edges of the complete graph of order n with 3 colors, then it contains a monochromatic copy of Gi in color i, for some 1 ≤ i ≤ 3. First, we prove that the conjectured equality R(C2n, C2n, C2n) = 4n, if true, implies that R(P2n+1, P2n+1, P2n+1) = 4n + 1 for all n ≥ 3...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2021
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math9070735